An Efficiently Updatable Index Scheme for Structured Documents
نویسندگان
چکیده
We propose an efficiently updatable index scheme for XML documents. This index scheme consists of four types of indices. Content index manages occurrence positions of words, element names, attribute names and attribute values. Local structure index manages logical structure of each document. Global structure index summarizes logical structure of document instances for a DTD. The last one is called structure meta index, and keeps, for each element, the number of local structure indices and global structure indices which include the element. Using our four types of indices, therefore, a wide range of queries over structured documents can be processed eficiently. We compare our indices with existing indices in terms of index size, update cost and retrieval cost.
منابع مشابه
Path-expression Queries over Multiversion XML Documents
In this paper we address the problem of evaluating path expression queries on multiversion XML documents. Such queries are typically implemented on static (i.e., non-versioned) documents as path joins, using numbering schemes that maintain the structural relationships among the document elements. We extend previously proposed pattern matching techniques so as to support versions. We first prese...
متن کاملCryptography with Updates
Starting with the work of Bellare, Goldreich and Goldwasser [CRYPTO’94], a rich line of work has studied the design of updatable cryptographic primitives. For example, in an updatable signature scheme, it is possible to efficiently transform a signature over a message into a signature over a related message without recomputing a fresh signature. In this work, we continue this line of research, ...
متن کاملAn Efficient XML Index Structure with Bottom-Up Query Processing
With the growing importance of XML in data exchange, much research has been done in proving flexible query mechanisms to extract data from structured XML documents. The semi-structured nature of XML data and the requirements on query flexibility pose unique challenges to database indexing methods. Recently, ViST that uses suffix tree and BTree was proposed to reduce the search time of the docum...
متن کاملOptimization of Mining Association Rule from XML Documents
Association rule mining finds the interesting correlation among a large set of data items. With a large amount of data being collected and stored continuously in databases, it has become mandatory to mine interesting relationship between the attributes. Semi-structured data refers to set of data with some implicit structure but not enough of a regular. Mining association rule from semi-structur...
متن کاملSeparating indexes from data: a distributed scheme for secure database outsourcing
Database outsourcing is an idea to eliminate the burden of database management from organizations. Since data is a critical asset of organizations, preserving its privacy from outside adversary and untrusted server should be warranted. In this paper, we present a distributed scheme based on storing shares of data on different servers and separating indexes from data on a distinct server. Shamir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998